Generalized Simplex Algorithm to Solve Fuzzy Linear Programming Problems with Ranking of Generalized Fuzzy Numbers

In this paper the shortcomings of an existing method for comparing the generalized fuzzy numbers are pointed out and a new method is proposed for same. Also using the proposed ranking method, a generalized simplex algorithm is proposed for solving a special type of fuzzy linear programming (FLP) problems. To illustrate the proposed algorithm a numerical example is solved and the advantages of the proposed algorithm are discussed. Since the proposed algorithm is a direct extension of classical algorithm so it is very easy to understand and apply the proposed algorithm to find the fuzzy optimal solution of FLP problems occurring in the real life situations.